A fast orthogonal matching pursuit algorithm
نویسندگان
چکیده
The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has computational complexity very close to that of the nonorthogonal version.
منابع مشابه
Improved Sparse Multi-path Channel Estimation via Modified Orthogonal Matching Pursuit
Impulse response of sparse multi-path channel (SMPC) can be recovered from a short training sequence since most entries of SMPC are zeros. Though the ordinary orthogonal matching pursuit (OMP) algorithm provides a very fast implementation of SMPC estimation, it suffers from the coherence of atoms in dictionary, especially in the case of SMPC with a large delay spread and short training sequence...
متن کاملA dedicated greedy pursuit algorithm for sparse spectral modelling of music sound
A dedicated algorithm for sparse spectral modeling of music sound is presented. The goal is to enable the representation of a piece of music signal, as a linear superposition of as few spectral components as possible. A representation of this nature is said to be sparse. In the present context sparsity is accomplished by greedy selection of the spectral components, from an overcomplete set call...
متن کاملInferring sparse representations of continuous signals with continuous orthogonal matching pursuit
Many signals, such as spike trains recorded in multi-channel electrophysiological recordings, may be represented as the sparse sum of translated and scaled copies of waveforms whose timing and amplitudes are of interest. From the aggregate signal, one may seek to estimate the identities, amplitudes, and translations of the waveforms that compose the signal. Here we present a fast method for rec...
متن کاملFast Atomic Decomposition by the Inhibition Method
A new algorithm is introduced which is related to matching pursuit but allows updating more than one coding coefficient per iteration: the updated coefficients correspond to mutually orthogonal elements of the dictionary. Coding experiments on natural images show that the new method achieves the same trade-off as matching pursuit between number of coding coefficients and reconstruction error, b...
متن کاملHierarchical Matching Pursuit for Image Classification: Architecture and Fast Algorithms
Extracting good representations from images is essential for many computer vision tasks. In this paper, we propose hierarchical matching pursuit (HMP), which builds a feature hierarchy layer-by-layer using an efficient matching pursuit encoder. It includes three modules: batch (tree) orthogonal matching pursuit, spatial pyramid max pooling, and contrast normalization. We investigate the archite...
متن کامل